Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
نویسندگان
چکیده
منابع مشابه
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches of refined products and grades are pumped back-to-back in the same pipeline, often without any separation device between batches. The sequence and lengths of such pumping runs should be carefully selected in order to ...
متن کاملAn Milp Formulation for the Scheduling of Multiproduct Pipeline Systems
Pipelines provide an economic mode of fluid transportation for petroleum systems, specially when large amounts of these products have to be pumped for large distances. The system discussed in this paper is composed of a petroleum refinery, a multiproduct pipeline connected to several depots and the corresponding consumer markets that receive large amounts of gasoline, diesel, LPG and aviation f...
متن کاملScheduling of a multiproduct pipeline system
Pipelines provide an economic fluid transportation mode for petroleum systems, especially when large amounts of petroleum derivatives have to be pumped for long distances. The system reported in this paper is composed by an oil refinery, one multiproduct pipeline connected to several depots and to the local consumer markets that receive large amounts of oil products. Extensive distances must be...
متن کاملUsing CLP and MILP for Scheduling Commodities in a Pipeline
This paper addresses the problem of developing an optimization structure to aid the operational decision-making in a real-world pipeline scenario. The pipeline connects an inland refinery to a harbor, conveying different types of commodities (gasoline, diesel, kerosene, alcohol, liquefied petroleum gas, etc). The scheduling of activities has to be specified in advance by a specialist, who must ...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2004
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2004.03.010